Extreme point characterizations for infinite network flow problems
نویسندگان
چکیده
منابع مشابه
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models includes, for example, all infinite horizon deterministic dynamic programs with finite action sets, because these are equivalent to the problem of finding a shortest path in an infinite directed network. We derive necessary and suffi...
متن کاملExtreme Point Solutions for Infinite Network Flow Problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models includes, for example, all infinite horizon deterministic dynamic programs with finite action sets since these are equivalent to the problem of finding a shortest infinite path in an infinite directed network. We derive ...
متن کاملExtreme inequalities for infinite group problems
In this paper we derive new properties of extreme inequalities for infinite group problems. We develop tools to prove that given valid inequalities for the infinite group problem are extreme. These results show that integer infinite group problems have discontinuous extreme inequalities. These inequalities are strong when compared to related classes of continuous extreme inequalities. This give...
متن کاملCombinatorial interior point methods for generalized network flow problems
We present combinatorial interior point methods for the generalized minimum cost flow and the generalized circulation problems based on Wallacher and Zimmermann’s combinatorial interior point method for the minimum cost network flow problem. The algorithms have features of both a combinatorial algorithm and an interior point method. They work towards optimality by iteratively reducing the value...
متن کاملAlgebraic characterizations of flow-network typings
A flow network N is a capacited finite directed graph, with multiple input ports/arcs and multiple output ports/arcs. A flow f in N assigns a non-negative real number to every arc and is feasible if it satisfies flow conservation at every node and respects lower-bound/upper-bound capacities at every arc. We develop an algebraic theory of feasible flows in such networks with several beneficial c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2006
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20134